Maps for Easy Paths (MEP): Accessible Paths Tracking and Reconstruction

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maps for Easy Paths (MEP): Accessible Paths Tracking and Reconstruction

MEP (Maps for Easy Paths) is a project for the enrichment of geographical maps with information about accessibility of urban pedestrian pathways, targeted at people with mobility problems. In this paper, we describe the tools developed to collect data along the paths travelled by target people and the algorithms for a good quality reconstruction of the path developed to overcome the intrinsic l...

متن کامل

Sweep maps for lattice paths ( extended abstract )

Sweep maps are a family of maps on words that, while simple to define, are not yet known to be injective in general. This family subsumes many of the “zeta maps” that have arisen in the study of q, t-Catalan numbers in the course of relating the three statistics of area, bounce and dinv. A sweep map can be defined for words over arbitrary alphabets with arbitrary weights. The latter property ma...

متن کامل

Paths of Wellbeing on Self-Organizing Maps

In this article, we introduce the concept of pathways of wellbeing and examine how such paths can be discovered from large data sets using the self-organizing map. Data sets used in the illustrative experiments include measurements of physical fitness and subjective assessments related to diagnosing work stress.

متن کامل

Characterization of signed paths and cycles admitting minus dominating function

If G = (V, E, σ) is a finite signed graph, a function f : V → {−1, 0, 1} is a minusdominating function (MDF) of G if f(u) +summation over all vertices v∈N(u) of σ(uv)f(v) ≥ 1 for all u ∈ V . In this paper we characterize signed paths and cycles admitting an MDF.

متن کامل

Describing 3-paths in normal plane maps

We prove that every normal plane map, as well as every 3polytope, has a path on three vertices whose degrees are bounded from above by one of the following triplets: $(3,3,\infty)$, $(3,4,11)$, $(3,7,6)$, $(3,10,4)$, $(3,15,3)$, $(4,4,9)$, $(6,4,8)$, $(7,4,7)$, and $(6,5,6)$. No parameter of this description can be improved, as shown by appropriate 3-polytopes. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EAI Endorsed Transactions on Internet of Things

سال: 2017

ISSN: 2414-1399

DOI: 10.4108/eai.31-8-2017.153050